Stepwise Redesign of Distributed Relational Databases Y Stepwise Redesign of Distributed Relational Databases 2

نویسندگان

  • L. Kazerouni
  • K. Karlapalem
  • Ladan Kazerouni
  • Kamalakar Karlapalem
چکیده

Designing distributed databases is an issue of paramount importance for executing transactions eeciently. The distributed database design process consists of three phases namely, the initial design, redesign and materialization of the redesign. The initial design consists of a fragmentation and an allocation scheme which minimize the irrelevant data access cost and data transfer cost. Over a period of time there may be physical and logical changes which eeect the processing of transactions on a distributed relational database system. These changes necessitate redesign of the distributed databases in order to keep the performance of transactions from degrading. In this paper, we address the problem of stepwise redesign of distributed relational databases. A stepwise redesign is a process by which a new design is eeected in a dynamic processing environment by monitoring irrelevant data access and data transfer cost. Stepwise redesign of a distributed database consists of a split phase or/and merge phase. The split phase attempts to break a fragment into smaller fragments based on the transactions accessing diierent parts of the fragment. On the other hand, a merge phase attempts to construct a merged fragment from a set of fragments ac-cessed together by a set of transactions. We present experimental results to evaluate the eeectiveness and the utility of the stepwise redesign methodology.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Materialization of Redesigned Distributed Relational Databases 1 Kamalakar Karlapalem

The changes in the distributed database environment during its lifetime necessitate a redesign of the distributed databases so as to keep the performance of the applications/transactions from degrading. Till now most of the work in distributed database design dealt with developing better fragmentation and allocation algorithms. This paper introduces an hitherto unexplored step in distributed da...

متن کامل

H-store: a high-performance, distributed main memory transaction processing system

Our previous work has shown that architectural and application shifts have resulted in modern OLTP databases increasingly falling short of optimal performance [10]. In particular, the availability of multiple-cores, the abundance of main memory, the lack of user stalls, and the dominant use of stored procedures are factors that portend a clean-slate redesign of RDBMSs. This previous work showed...

متن کامل

A Watermarking Framework for Outsourced and Distributed Relational Databases

Unlike centralized databases, watermarking of distributed databases faces serious challenges for various reasons, e.g. (i) Distribution of data (ii) Existence of replication (iii) Preservation of watermarks while partitioning and distributing databases, etc. In this paper, we propose a novel watermarking technique for distributed relational databases considering a generic scenario that supports...

متن کامل

Converting Relational Database into XML Document

XML (Extensible Markup Language) is emerging and gradually accepted as the standard for data interchange in the Internet world. Interoperation of relational database and XML database involves schema and data translations. Through EER (extended entity relationship) model can convert the schema of relational database into XML. The semantics of the relational database, captured in EER diagram, are...

متن کامل

Review of Relational Algebra for Query Processing in Dynamic Distributed Federated Databases

This paper reviews the coverage of formal Relational Algebra as it applies to distributed, federated databases in varying network topologies. The review shows that a number of Relational Algebra extensions allow distributed relations and federation of heterogeneous database schema. More concrete physical Relational Algebra extensions support access plans for multi-database query processing but ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997